Computations for Coxeter arrangements and Solomon's descent algebra: Groups of rank three and four

نویسندگان

  • Marcus Bishop
  • J. Matthew Douglass
  • Götz Pfeiffer
  • Gerhard Röhrle
چکیده

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of the representation of a finite Coxeter group W on the pth graded piece of its Orlik-Solomon algebra as a sum of characters induced from linear characters of centralizers of elements of W . Our refined conjecture relates the character of W on the pth graded piece of its Orlik-Solomon algebra with the descent algebra of W . A consequence of our conjecture is that both the regular character of W and the character of W acting on its Orlik-Solomon algebra have parallel, graded decompositions as sums of characters induced from linear characters of centralizers of elements of W , one for each conjugacy class of elements of W . The refined conjectures have been proved for symmetric and dihedral groups. In this paper we develop algorithmic tools to prove the conjectures computationally for a given W and we use these tools to verify the claim for all finite Coxeter groups of rank three and four. The techniques developed and implemented in this paper provide previously unknown decompositions of the regular characters and the Orlik-Solomon characters of the Coxeter groups of types B3, H3, B4, D4, F4, and H4 as sums of induced representations indexed by the set of conjugacy classes of W .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Descent Algebras, Hyperplane Arrangements, and Shuuing Cards

This note establishes a connection between Solomon's descent algebras and the theory of hyperplane arrangements. It is shown that card-shu ing measures on Coxeter groups, originally de ned in terms of descent algebras, have an elegant combinatorial description in terms of randomwalk on the chambers of hyperplane arrangements. As a corollary, a positivity conjecture of Fulman is proved. 2

متن کامل

ar X iv : 0 70 6 . 27 11 v 1 [ m at h . C O ] 1 9 Ju n 20 07 A Multiplication Rule for the Descent Algebra of Type D

Here we give an interpretation of Solomon's rule for multiplication in the descent algebra of Coxeter groups of type D, ΣDn. We describe an ideal I such that ΣDn/I is isomorphic to the descent algebra of the hyperoctahedral group, ΣBn−2.

متن کامل

v 4 [ m at h . C O ] 1 5 Ju l 1 99 9 Descent Algebras , Hyperplane Arrangements , and Shuffling Cards

Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon’s descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types A,B,C, H3, and rank two groups. Both notions have the same, simple eigenvalues. The hyperplane definition is especially natural and satisfies a positivity property when W is crystallographic and the...

متن کامل

An inductive approach to Coxeter arrangements and Solomon’s descent algebra

In our recent paper (Douglass et al. arXiv:1101.2075 (2011)), we claimed that both the group algebra of a finite Coxeter group W as well as the Orlik–Solomon algebra of W can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each conjugacy class of elements of W , and gave a uniform proof of this claim for symmetric groups. In this note, we outline an ...

متن کامل

Descent Algebras , Hyperplane Arrangements , and Shuffling Cards

Abstract Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon’s descent algebra and another using random walk on chambers of hyperplane arrangements. These definitions coincide for types A,B,H3, and rank two groups. Both notions satisfy a convolution property and have the same simple eigenvalues. The hyperplane definition is especially natural and satisfies a po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2013